Methods of Approximation in hpk Framework for ODEs in Time Resulting from Decoupling of Space and Time in IVPs
نویسندگان
چکیده
The present study considers mathematical classification of the time differential operators and then applies methods of approximation in time such as Galerkin method ( GM ), Galerkin method with weak form ( / GM WF ), Petrov-Galerkin method ( PGM ), weighted residual method (WRY ), and least squares method or process ( LSM or LSP ) to construct finite element approximations in time. A correspondence is established between these integral forms and the elements of the calculus of variations: 1) to determine which methods of approximation yield unconditionally stable (variationally consistent integral forms, VC ) computational processes for which types of operators and, 2) to establish which integral forms do not yield unconditionally stable computations (variationally inconsistent integral forms, VIC ). It is shown that variationally consistent time integral forms in hpk framework yield computational processes for ODEs in time that are unconditionally stable, provide a mechanism of higher order global differentiability approximations as well as higher degree local approximations in time, provide control over approximation error when used as a time marching process and can indeed yield time accurate solutions of the evolution. Numerical studies are presented using standard model problems from the literature and the results are compared with Wilson’s method as well as Newmark method to demonstrate highly meritorious features of the proposed methodology.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملWavelet analysis of GRACE K-band range rate measurements related to Urmia Basin
Space-borne gravity data from Gravity Recovery and Climate Experiment (GRACE), as well as some other in situ and remotely sensed satellite data have been used to determine water storage changes in Lake Urmia Basin (Iran). As usual, the GRACE products are derived from precise inter-satellite range rate measurements converted to different formats such as spherical harmonic coefficients and equiva...
متن کاملValidated solutions of initial value problems for ordinary differential equations
Compared to standard numerical methods for initial value problems (IVPs) for ordinary diierential equations (ODEs), validated methods for IVPs for ODEs have two important advantages: if they return a solution to a problem, then (1) the problem is guaranteed to have a unique solution, and (2) an enclosure of the true solution is produced. The authors survey Taylor series methods for validated so...
متن کامل2-stage explicit total variation diminishing preserving Runge-Kutta methods
In this paper, we investigate the total variation diminishing property for a class of 2-stage explicit Rung-Kutta methods of order two (RK2) when applied to the numerical solution of special nonlinear initial value problems (IVPs) for (ODEs). Schemes preserving the essential physical property of diminishing total variation are of great importance in practice. Such schemes are free of spurious o...
متن کاملEconomical Error Estimates for Block Implicit Methods for ODEs via Deferred Correction
Deferred correction is a widely used tool for improving the numerical approximation to the solution of ODE problems [10, 11, 12, 13, 16, 17, 18, 19, 20, 21, 23]. Indeed, it allows to estimate the error due to the use of discrete methods. Such an estimate may be a global one, in the case of continuous BVPs, or a local one, when IVPs are to be approximated [2, 7]. Recently, it has been implemente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- American J. Computational Mathematics
دوره 1 شماره
صفحات -
تاریخ انتشار 2011